Symbolic Unfoldings for Networks of Timed Automata
نویسندگان
چکیده
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.
منابع مشابه
Unfoldings of Networks of Automata and their Application in Supervision
In this article we present techniques of unfoldings of networks of automata. This type of techniques allows capturing the causal relations of partial order between events of a model of a distributed system. They are particularly tailored to address the issue of supervision. Given a sequence of actions observed during an execution of a distributed application it is possible, using a model of the...
متن کاملUnfoldings for Message Passing Timed Automata
In this thesis we develop a state space reduction technique for networks of timed automata based on unfoldings to alleviate the state space explosion problem due to concurrently enabled actions. For the purpose of verifying a system, standard model checking techniques construct its sequential state space that su ers an exponential growth when applied to distributed systems because of concurrent...
متن کاملTimed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here, we design a verification algorithm for networks of timed automata with invariants. Based on the unfolding technique, our method produces a branching process as an acyclic Petri net extended with read arcs. These arc...
متن کاملSome Progress in the Symbolic Veri cation of Timed Automata
In this paper we discuss the practical di culty of analyzing the behavior of timed automata and report some results obtained using an experimental bdd based extension of kronos We have treated exam ples originating from timing analysis of asynchronous boolean networks and CMOS circuits with delay uncertainties and the results outperform those obtained by previous implementations of timed automa...
متن کاملSYMBOLIC IMPLEMENTATION OF MODEL - CHECKING PROBABILISTIC TIMED AUTOMATA by FUZHI WANG
In this thesis, we present symbolic implementation techniques for model checking probabilistic timed automata as models for systems, for example, communication networks and randomised distributed algorithms. Given a system model as probabilistic timed automata and a specification, such as, “a leader will be elected within 5 time units with probability 0.999” and “the message can be successfully...
متن کامل